Performance Evaluation of Approximate Priority Queues
نویسنده
چکیده
We report on implementation and a modest experimental evaluation of a recently introduced priority queue data structure The new data structure is designed to take advantage of fast operations on machine words and as appropriate reduced key universe size and or tolerance of approximate answers to queries In addition to standard priority queue operations the data structure also supports successor and predecessor queries Our results suggest that the data structure is practical and can be faster than traditional priority queues when holding a large number of keys and that tolerance for approximate answers can lead to signi cant increases in speed Bell Laboratories Mountain Ave Murray Hill NJ matias research bell labs com Bell Laboratories Mountain Ave Murray Hill NJ jenk research bell labs com The author was also a liated with Department of Computer Science University of Maryland College Park MD when the experiments were conducted Department of Computer Science Dartmouth College Hanover NH ney cs dartmouth edu speedup n An employer s demand for accelerated output without increased pay Webster s dictionary
منابع مشابه
Class-based weighted fair queuing scheduling on quad-priority Delta Networks
Contemporary networks accommodate handling of multiple priorities, aiming to provide suitable QoS levels to different traffic classes. In the presence of multiple priorities, a scheduling algorithm is employed to select each time the next packet to transmit over the data link. Class-based Weighted Fair Queuing (CBWFQ) scheduling and its variations, is widely used as a scheduling technique, sinc...
متن کاملFast and Lock-Free Concurrent Priority Queues for Multi-Thread Systems
We present an efficient and practical lock-free implementation of a concurrent priority queue that is suitable for both fully concurrent (large multi-processor) systems as well as pre-emptive (multi-process) systems. Many algorithms for concurrent priority queues are based on mutual exclusion. However, mutual exclusion causes blocking which has several drawbacks and degrades the overall perform...
متن کاملFast and Lock - Free Concurrent Priority Queues for Multi - Thread Systems 1 Håkan
We present an efficient and practical lock-free implementation of a concurrent priority queue that is suitable for both fully concurrent (large multi-processor) systems as well as pre-emptive (multi-process) systems. Many algorithms for concurrent priority queues are based on mutual exclusion. However, mutual exclusion causes blocking which has several drawbacks and degrades the system’s overal...
متن کاملA modified HOL priority scheduling discipline: Performance analysis
In this paper, we introduce and analyze a modified HOL (head-of-the-line) priority scheduling discipline. The modification is incorporated to cope with the so-called starvation problem of regular HOL priority queues. We consider a discrete-time single-server queueing system with two priority queues of infinite capacity and with the introduced priority scheme. We show that the use of probability...
متن کاملA Fast Matrix-analytic Approximation for the Two Class Gi/g/1 Non-preemptive Priority Queue
In this paper we present the approximate waiting time analysis of two class non-preemptive priority queues. The traffics of the queue are characterized by ”two parameter description”, which means that the mean and the squared coefficient of variation of the inter arrival times and of the service times are given. The solution is based on the separate analysis of the low and high priority queue. ...
متن کامل